Linear Time Algorithms to the Minimum All-Ones Problem for UniCyclic and Bicyclic Graphs
نویسندگان
چکیده
In this paper, we give graph-theoretic algorithms of linear time to the Minimum All-Ones Problem for unicyclic and bicyclic graphs. These algorithms are based on a graph-theoretic algorithm of linear time to the Minimum All-Ones Problem with Restrictions for trees.
منابع مشابه
On the harmonic index of the unicyclic and bicyclic graphs
The harmonic index is one of the most important indices in chemical and mathematical fields. It’s a variant of the Randić index which is the most successful molecular descriptor in structure-property and structureactivity relationships studies. The harmonic index gives somewhat better correlations with physical and chemical properties comparing with the well known Randić index. The harmonic ind...
متن کاملUnicyclic and bicyclic graphs having minimum degree distance
In this paper characterizations of connected unicyclic and bicyclic graphs in terms of the degree sequence, as well as the graphs in these classes minimal with respect to the degree distance are given. © 2007 Elsevier B.V. All rights reserved.
متن کاملThe Harmonic Index for Unicyclic and Bicyclic Graphs with given Matching Number
The harmonic index of a graph G is defined as the sum of the weights 2 d.u/Cd.v/ of all edges uv of G, where d.u/ denotes the degree of a vertex u in G. In this paper, we present the minimum harmonic indices for unicyclic and bicyclic graphs with n vertices and matching number m (2 m bn2 c), respectively. The corresponding extremal graphs are also characterized. 2000 Mathematics Subject Classif...
متن کاملOn the complexity of dominating set problems
The minimum all-ones problem and the connected odd dominating set problem were shown to be NP-complete in different papers for general graphs, while they are solvable in linear time (or trivial) for trees, unicyclic graphs, and series-parallel graphs. The complexity of both problems when restricted to bipartite graphs was raised as an open question. Here we solve both problems. For this purpose...
متن کاملThe spectral radius of unicyclic and bicyclic graphs with n vertices and k pendant vertices
In this paper, we determine graphs with the largest spectral radius among all the unicyclic and all the bicyclic graphs with n vertices and k pendant vertices, respectively. © 2005 Elsevier Inc. All rights reserved. AMS classification: 05C50
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Notes in Discrete Mathematics
دوره 17 شماره
صفحات -
تاریخ انتشار 2004